Local Squares, Periodicity and Finite Automata
نویسندگان
چکیده
We consider the general problem when local regularity implies the global one in the setting where local regularity means the existence of a square of certain length in every position of an infinite word. The square can occur as centered or to the left or to the right from each position. In each case there are three variants of the problem depending on whether the square is that of words, that of abelian words or, as an in between case, that of so called k-abelian words. The above nine variants of the problem are completely solved, and some open problems are addressed in the k-abelian case. Finally, an amazing unavoidability result for 2-abelian squares is obtained.
منابع مشابه
Strongly Almost Periodic Sequences under Finite Automata Mappings
The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the field of symbolic dynamics, but then turned out to be interesting in connection with computer science. The paper studies the class of eventually strongly almost periodic sequences (i. e., becoming strongly almost peri...
متن کاملAlmost Periodicity, Finite Automata Mappings and Related Effectiveness Issues
The paper studies different variants of almost periodicity notion. We introduce the class of eventually strongly almost periodic sequences where some suffix is strongly almost periodic (=uniformly recurrent). The class of almost periodic sequences includes the class of eventually strongly almost periodic sequences, and we prove this inclusion to be strict. We prove that the class of eventually ...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملGAME OF COORDINATION FOR BACTERIAL PATTERN FORMATION: A FINITE AUTOMATA MODELLING
In this paper, we use game theory to describe the emergence of self-organization and consequent pattern formation through communicative cooperation in Bacillus subtilis colonies. The emergence of cooperative regime is modelled as an n-player Assurance game, with the bacterial colonies as individual players. The game is played iteratively through cooperative communication, and mediated by exchan...
متن کاملPeriodicity in a System of Differential Equations with Finite Delay
The existence and uniqueness of a periodic solution of the system of differential equations d dt x(t) = A(t)x(t − ) are proved. In particular the Krasnoselskii’s fixed point theorem and the contraction mapping principle are used in the analysis. In addition, the notion of fundamental matrix solution coupled with Floquet theory is also employed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011